Upper Bounds on the Number of Errors Corrected by the Koetter-Vardy Algorithm

By introducing a few simplifying assumptions we derive a simple condition for successful decoding using the Koetter–Vardy algorithm for soft-decision decoding of Reed–Solomon codes. We show that the algorithm has a significant advantage over hard decision decoding when the code rate is low, when two or more sets of received symbols have substantially different reliabilities, or when the number of alternative transmitted symbols is very small.